A Note on the Reversibility of the Elementary Cellular Automaton with Rule Number 90
نویسنده
چکیده
The reversibility properties of the elementary cellular automaton with rule number 90 are studied. It is shown that the cellular automaton considered is not reversible when periodic boundary conditions are considered, whereas when null boundary conditions are stated, the reversibility appears when the number of cells of the cellular space is even. The DETGTRI algorithm is used to prove these statements. Moreover, the explicit expressions of inverse cellular automata of reversible ones are computed.
منابع مشابه
Particle Structures in Elementary Cellular Automaton Rule 146
Stochastic particle-like persistent structures are found in the class 3 elementary cellular automaton rule number 146. These particles arise as boundaries separating regions with black cells occupying sites at spacetime points Hx, tL of constant parity x⊕ t. The particles execute random walks and annihilate in pairs, with particle density decaying with time in a power-law fashion. It is shown t...
متن کاملA Walsh Exploration of Elementary CA Rules
In this paper, we explore the 256 elementary cellular automata rules by a Walsh transform in order to find out correlation-immune rules for generating good pseudo-random sequences. We prove that, except the 8 linear rules, there is no correlation-immune rule among the 256 rules. Thus, Wolfram cellular automata cannot be used as a cryptographic pseudo-random generator since the generated pseudo-...
متن کاملSimple Cellular Automata-Based Linear Models for the Shrinking Generator
Structural properties of two well-known families of keystream generators, Shrinking Generators and Cellular Automata, have been analyzed. Emphasis is on the equivalence of the binary sequences obtained from both kinds of generators. In fact, Shrinking Generators (SG) can be identified with a subset of linear Cellular Automata (mainly rule 90, rule 150 or a hybrid combination of both rules). The...
متن کاملAn Information Theoretic Analysis of Random Number Generator based on Cellular Automaton
Realization of Randomness had always been a controversial concept with great importance both from theoretical and practical Perspectives. This realization has been revolutionized in the light of recent studies especially in the realms of Chaos Theory, Algorithmic Information Theory and Emergent behavior in complex systems. We briefly discuss different definitions of Randomness and also differen...
متن کاملCharacteristic and Minimal Polynomials of Linear Cellular Automata
The 1984 article by Martin, Odlyzko and Wolfram on Wolfram’s Rule 90 heightened interest in the area of linear cellular automata defined on a vector space over a finite field [8]. In this article we find the closed form expression for the minimal polynomial of Rule 90, which is then used to completely characterize the dynamics of the map. In addition, we show that the standard basis vectors in ...
متن کامل